/**
 * 0746
 *  
 * @Author : roryrywang
 * @DateTime : 2024/8/16 0:26
 */

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

class Solution {
public:
    int minCostClimbingStairs(vector<int> &cost) {
        int f[cost.size() + 1];
        f[0] = 0;
        f[1] = 0;

        for (int i = 2; i <= cost.size(); ++i) {
            f[i] = min(f[i - 1] + cost[i - 1], f[i - 2] + cost[i - 2]);
        }

        return f[cost.size()];
    }
};

int main() {

    return 0;
}